Approximate Zeros of Quadratically Convergent Algorithms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Zeros of Quadratically Convergent Algorithms

Smale's condition for a point to be an approximate zero of a function for Newton's method is extended to the general quadratically convergent iterative algorithm. It is shown in which way the bound in the condition is affected by the characteristics of the algorithm. This puts the original condition of Smale for Newton's method in a more general perspective. The results are also discussed in th...

متن کامل

Quadratically convergent algorithms for optimal dextrous hand grasping

There is a robotic balancing task, namely real-time dextrous-hand grasping, for which linearly constrained, positive definite programming gives a quite satisfactory solution from an engineering point of view. We here propose refinements of this approach to reduce the computational effort. The refinements include elimination of structural constraints in the positive definite matrices, orthogonal...

متن کامل

A quadratically convergent VBSCF method.

A quadratically convergent valence bond self-consistent field method is described where the simultaneous optimisation of orbitals and the coefficients of the configurations (VB structures) is based on a Newton-Raphson scheme. The applicability of the method is demonstrated in actual calculations. The convergence and efficiency are compared with the Super-CI method. A necessary condition to achi...

متن کامل

Globally convergent algorithms for finding zeros of duplomonotone mappings

We introduce a new class of mappings, called duplomonotone, which is strictly broader than the class ofmonotonemappings.We study some of themain properties of duplomonotone functions and provide various examples, including nonlinear duplomonotone functions arising from the study of systems of biochemical reactions. Finally,we present three variations of a derivative-free line search algorithm f...

متن کامل

Globally convergent algorithms for nding zeros of duplomonotone mappings

We introduce a new class of mappings, called duplomonotone, which is strictly broader than the class of monotone mappings. We study some of the main properties of duplomonotone functions and provide various examples, including nonlinear duplomonotone functions arising from the study of systems of biochemical reactions. Finally, we present three variations of a derivative-free line search algori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1994

ISSN: 0025-5718

DOI: 10.2307/2153572